Constant hue loci across spectral bandwidth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization for Hue Constant RGB Sensors

We present an optimization technique to find hue constant RGB sensors. The hue representation is based on a log RGB opponent color space that is invariant to brightness and gamma. While modeling the visual response did not derive the opponent space, the hue definition is similar to the ones found in CIE Lab and IPT. Finding hue constant RGB sensors through this optimization might be applicable ...

متن کامل

Gamut Mapping in Munsell Constant Hue Sections

The problem of gamut mapping is of interest in achieving an optimum color reproduction whenever a translation from one device (source) to another device (destination) is requested and the source gamut differs from destination gamut. For printing applications, if the ICC profile specifications are used, gamut mapping is applied to build the color tables that characterize the printing device. Wit...

متن کامل

Tests of a functional account of the Abney effect.

The Abney effect refers to changes in the hue of lights as they are desaturated. Normally the purity is varied by desaturating with a fixed spectrum. Mizokami et al. [J. Vis.6, 996 (2006)] instead varied purity by using Gaussian spectra and increasing their bandwidth. Under these conditions the hues of lights at short and medium wavelengths tended to remain constant and thus were tied to a fixed ...

متن کامل

Searching Paths of Constant Bandwidth

As a generalization of paths, the notion of paths of bandwidth w is introduced. We show that, for constant w ≥ 1, the corresponding search problem for such a path of length k in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter k, like this is known for the special case w = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check prot...

متن کامل

Greedy reclamation of unused bandwidth in constant-bandwidth servers

A framework for scheduling a number of di erent applications on a single shared preemptable processor is proposed, such that each application seems to be executing on a slower dedicated processor. A tradeo is identi ed and evaluated between how precise a notion of real time (as measured by the granularity of its clock) an application needs supported on the one hand, and the added context-switch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Vision

سال: 2010

ISSN: 1534-7362

DOI: 10.1167/3.12.61